Tight Bounds on the Descriptional Complexity of Regular Expressions
نویسندگان
چکیده
We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite automata to regular expressions, study the effect of the complementation operation on the descriptional complexity of regular expressions, and the conversion of regular expressions extended by adding intersection or interleaving to ordinary regular expressions. Almost all obtained lower bounds are optimal, and the presented examples are over a binary alphabet, which is best possible.
منابع مشابه
Language Operations with Regular Expressions of Polynomial Size
In the last 20 years, a large body of research on the descriptional complexity of finite automata has been developed. To the authors’ knowledge, the first systematic attempt to start a parallel development for the descriptional complexity of regular expressions was presented by Ellul et al. [4] at the workshop “Descriptional Complexity of Formal Systems” (DCFS), in 2002. In particular, they rai...
متن کاملFrom Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. We also briefly recall the known bounds for the removal of ...
متن کاملDescriptional Complexity of Deterministic Regular Expressions
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions. First, we examine possible blow-ups when translating between regular expressions, deterministic regular expressions, and deterministic automata. Then we give an overview of the closure properties of these languages under various language-theoretic operations and we study the descr...
متن کاملFinite Automata, Digraph Connectivity, and Regular Expression Size
We study some descriptional complexity aspects of regular expressions. In particular, we give lower bounds on the minimum required size for the conversion of deterministic finite automata into regular expressions and on the required size of regular expressions resulting from applying some basic language operations on them, namely intersection, shuffle, and complement. Some of the lower bounds o...
متن کاملAn Introduction to Descriptional Complexity of Regular Languages through Analytic Combinatorics
Nowadays, an increasing attention is being given to the study of the descriptional complexity on the average case. Although the underlying theory for such a study seems intimidating, one can obtain interesting results in this area without too much effort. In this gentle introduction we take the reader on a journey through the basic analytical tools of that theory, giving some illustrative examp...
متن کامل